//headers 
#include<algorithm>
#include<cassert>
#include<cstdio>
#include<deque>
#include<iostream>
#include<list>
#include<map>
#include<numeric>
#include<deque>
#include<set>
#include<string>
#include<sstream>
#include<stack>
#include<streambuf>
#include<vector>
using namespace std;

//macros
#define LET(x,a) typeof(a) x(a)
#define FOR(i,a,n) for(LET(i,a);i!=n;i++)
#define REP(i,n) FOR(i,0,n)
#define sz size()
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define dbge(x) cout<<#x<<"->"<<x<<endl;
#define PRINT(x) REP(i,x.sz) dbge(x[i]);
#define OUT(x) x<<" "
typedef LL long long
typedef VI vector<int>
typedef VS vector<string>
const int INF = (int) 1e16;

//code of suren


// depth first search 

const int N = 100;

int visited[N];
int grid[N][N];

// iterative form 

void dfs(int node){
  stack<int> st; st.push(node);
  while(!st.empty()){
    int top = st.top(); st.pop();
    
  }
}


